#include <iostream>
#include <queue>

using namespace std;

const int N = 100;
typedef pair<int, int> PII;
int g[N][N];
int d[N][N];
int n, m;

int bfs()
{
    queue<PII> q;
    memset(d, -1, sizeof(d));
    d[0][0] = 0;
    q.push({0, 0});
    int dx[4] = {1, 0, -1, 0}, dy[4] = {0, -1, 0, 1};
    while (!q.empty())
    {
        auto tmp = q.front();
        q.pop();
        for (int i = 0; i < 4; ++i)
        {
            int x = tmp.first + dx[i], y = tmp.second + dy[i];
            if (x >= 0 && x < n && y >= 0 && y < m && d[x][y] == -1 && g[x][y] == 0)
            {
                d[x][y] = d[tmp.first][tmp.second] + 1;
                q.push({x, y});
            }
        }
    }

    return d[n - 1][m - 1];
}

int main()
{
    cin >> n >> m;
    for (int i = 0; i < n; ++i)
    {
        for (int j = 0; j < m; ++j)
        {
            scanf("%d", &g[i][j]);
        }
    }
    printf("%d",bfs());
    return 0;
}